Cell forming and cell balancing of virtual cellular manufacturing systems with alternative processing routes using genetic algorithm

Authors

  • Adib Hosseini Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran
  • Iraj Mahdavi Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran
  • Javid Jouzdani PhD, Department of Industrial Engineering, Najafabad Branch, Islamic Azad University, Najafabad, Iran
Abstract:

Cellular manufacturing (CM) is one of the most important subfields in the design of manufacturing systems and as a recently emerged field of study and practice, virtual cellular manufacturing (VCM) inherits the importance from CM. One type of VCM problems is VCM with alternative processing routes from which the route for processing each part should be selected. In this research, a bi-objective mathematical programming model is designed in order to obtain optimal routing of parts, the layout of machines and the assignment of cells to locations and to minimize the production costs and to balance the cell loads. The proposed mathematical model is solved by multi-choice goal programming (MCGP). Since CM models are NP-Hard, a genetic algorithm (GA) is utilized to solve the model for large-sized problem instances and the results obtained from both methods are compared. Finally, a conclusion is made and some visions for future works are offered.Cellular manufacturing (CM) is one of the most important subfields in the design of manufacturing systems and as a recently emerged field of study and practice, virtual cellular manufacturing (VCM) inherits the importance from CM. One type of VCM problems is VCM with alternative processing routes from which the route for processing each part should be selected. In this research, a bi-objective mathematical programming model is designed in order to obtain optimal routing of parts, the layout of machines and the assignment of cells to locations and to minimize the production costs and to balance the cell loads. The proposed mathematical model is solved by multi-choice goal programming (MCGP). Since CM models are NP-Hard, a genetic algorithm (GA) is utilized to solve the model for large-sized problem instances and the results obtained from both methods are compared. Finally, a conclusion is made and some visions for future works are offered.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Cell Forming and Cell Balancing of Virtual Cellular Manufacturing Systems with Alternative Processing Routes Using Genetic Algorithm

Cellular manufacturing (CM) is one of the most important subfields in the design of manufacturing systems. As a recently emerged field of study and practice, virtual cellular manufacturing (VCM) is of enormous importance as one of the types of CM . One kind of VCM problems is VCM with alternative processing routes from which the route for processing each part should be selected. In this study, ...

full text

Scheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

full text

Scheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

full text

scheduling problem of virtual cellular manufacturing systems (vcms); using simulated annealing and genetic algorithm based heuristics

in this paper, we present a simulated annealing (sa) and a genetic algorithm (ga) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. a virtual manufacturing cell (vmc) is a group of resources that is dedicated to the manufacturing of a part family. although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

full text

Integrative Cell Formation and Layout Design in Cellular Manufacturing Systems

This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...

full text

An Efficient Algorithm to Inter and Intra-Cell Layout Problems in Cellular Manufacturing Systems with Stochastic Demands

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 9  issue 20

pages  41- 51

publication date 2016-09-25

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023